Global and local convergence of a penalty-free method for nonlinear programming
نویسندگان
چکیده
منابع مشابه
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
A scheme|inspired from an old idea due to Mayne and Polak (Math. Prog., vol. 11, 1976, pp. 67{80)|is proposed for extending to general smooth constrained optimization problems a previously proposed feasible interior-point method for inequality constrained problems. It is shown that the primal-dual interior point framework allows for a signi cantly more e ective implementation of the Mayne-Polak...
متن کاملOn the Fast Local Convergence of Interior-point `2-penalty Methods for Nonlinear Programming
In [3], two interior-point `2-penalty methods with strong global convergence properties were proposed for solving nonlinear programming problems. In this paper we show that under standard assumptions, slight modifications of these methods lead to fast local convergence. Specifically, we show that for each fixed small barrier parameter μ, iterates in a small neighborhood (roughly within o(μ)) of...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
In this paper, we consider a primal-dual interior point method for solving nonlinear semidefinite programming problems. We propose primal-dual interior point methods based on the unscaled and scaled Newton methods, which correspond to the AHO, HRVW/KSH/M and NT search directions in linear SDP problems. We analyze local behavior of our proposed methods and show their local and superlinear conver...
متن کاملGlobal convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
In this work we present an algorithm for solving constrained optimization problems that does not make explicit use of the objective function derivatives. The algorithm mixes an inexact restoration framework with filter techniques, where the forbidden regions can be given by the flat or slanting filter rule. Each iteration is decomposed in two independent phases: a feasibility phase which reduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2013
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2012.10.012